Priority based technique for rescheduling trains
نویسندگان
چکیده
منابع مشابه
Intelligent Rescheduling Trains for Air Pollution Management
Optimization of timetable is the need of the day for the rescheduling and routing of trains in real time. Trains are scheduled in parallel with the road transport vehicles to the same destination. As the number of trains is restricted due to single track, customers usually opt for road transport to use frequently. The air pollution increases as the density of vehicles on road transport is incre...
متن کاملPriority Based Rsa Cryptographic Technique
The RSA algorithm is one of the most commonly used efficient cryptographic algorithms. It provides the required amount of confidentiality, data integrity and privacy. This paper integrates the RSA Algorithm with round-robin priority scheduling scheme in order to extend the level of security and reduce the effectiveness of intrusion. It aims at obtaining minimal overhead, increased throughput an...
متن کاملA color-based visualization technique for multielectrode spike trains.
Multi electrode recordings of neuronal activity provide an overwhelming amount of data that is often difficult to analyze and interpret. Although various methods exist for treating multielectrode datasets quantitatively, there is a particularly prominent lack of techniques that enable a quick visual exploration of such datasets. Here, by using Kohonen self-organizing maps, we propose a simple t...
متن کاملOptimal Power Flow based on Generation Rescheduling Priority for Transient Stability Enhancement
This paper presents an optimal power flow method based on the generation rescheduling priority to enhance transient stability in power systems. In order to determine the generation rescheduling priority the energy margin sensitivity indices are calculated. The candidate generators for generation rescheduling are determined by the energy margin sensitivity indices and then optimal power flow (OP...
متن کاملA Dynamic Priority Assignment Technique for Streamswith
The problem of scheduling multiple streams of real-time customers is addressed in this paper. The paper rst introduces the notion of (m; k)-rm deadlines to better characterize the timing constraints of real-time streams. More speciically, a stream is said to have (m; k)-rm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m; k)-rm deadlines exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fundamental and Applied Sciences
سال: 2018
ISSN: 1112-9867
DOI: 10.4314/jfas.v9i5s.32